Security Patterns for Untraceable Secret Handshakes with optional Revocation

نویسندگان

  • Annett Laube
  • Alessandro Sorniotti
  • Paul El Khoury
  • Laurent Gomez
  • Angel Cuevas
چکیده

A security pattern describes a particular recurring security problem that arises in specific contexts and presents a well-proven generic solution for it. This paper describes Untraceable Secret Handshakes, cryptographic protocols that allow two users to mutually verify another’s properties without revealing their identity or other sensitive information. The complex security solution is split into smaller parts, which are described in an abstract way. The identified security problems and their solutions are captured as SERENITY security patterns. The structured description together with motivating scenarios from three different domains makes the security solution better understandable for non-security experts and helps to disseminate the security knowledge to application developers. Keywords-security patterns; secret handshake; cryptographic protocols; mutual authentication;

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Secret Handshakes with Revocation Support

Secret Handshake is becoming an ever more popular research subject in the field of privacypreserving authentication protocols. Revocation of credentials in Secret Handshakes is a difficult challenge, as it mixes the conflicting requirements of tracing revoked users and of the untraceability and unlinkability of legitimate protocol players. The schemes proposed in the literature are either limit...

متن کامل

Federated Secret Handshakes with Support for Revocation

Secret Handshakes are well-established cryptographic primitives that help two mistrusting users to establish initial trust by proving and verifying possession of given properties, such as group membership. All the Secret Handshake schemes to date assume the existence of a single, centralized Certification Authority (CA). We challenge this assumption and create the first Secret Handshake scheme ...

متن کامل

Optionally Identifiable Private Handshakes

It is now a trend that Internet users are increasingly concerned about individual privacy, and as a result numerous privacy-preserving authentication techniques have been proposed. In this paper, we propose the concept of private handshakes with optional identifiability, which allows the two users in a handshake deciding real time to either proceed their interaction as secret handshake or as pr...

متن کامل

Cryptanalysis of Efficient Unlinkable Secret Handshakes for Anonymous Communications

Several unlinkable secret handshakes schemes have been proposed in recent years. As performing the successful secret handshakes is essentially equivalent to computing a common key between two interactive members of the same group. Therefore secret handshakes scheme is a key agreement protocol between two members of the same group. So it is necessary for a secret handshakes scheme to fulfill sec...

متن کامل

A Provably Secure Secret Handshake with Dynamic Controlled Matching

Parties cooperating in hostile networked environments often need to establish an initial trust. Trust establishment can be very delicate when it involves the exchange of sensitive information, such as affiliation to a secret society or to an intelligence agency. Two mechanisms, Secret Handshakes and Secure Matchmaking, have tackled this problem, coming up with solutions for secure initial excha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010